Stamp Foldings, Semi-Meanders, and Open Meanders: Fast Generation Algorithms

Stamp Foldings, Semi-Meanders, and Open Meanders: Fast Generation Algorithms

By considering a permutation representation for stamp-foldings and semi-meanders we construct tree-like data structures that will allow us to generate these objects in constant amortized time. Additionally, by maintaining the wind-factor and applying an additional optimization, the algorithm for semi-meanders can be modified to produce the fastest known algorithm to generate open meanders.

Meanders and Stamp Foldings: Fast Generation Algorithms

By considering a permutation representation for meanders, semi-meanders, and stamp foldings we construct a new data structure that will allow us to extend the order of a given meander, semi-meander, or stamp folding in constant time. Then using this data structure, we develop a constant amortized time algorithm to generate all semi-meanders of order n. By maintaining the wind-factor for semi-me...

Foldings and meanders

We review the stamp folding problem, the number of ways to fold a strip of n stamps, and the related problem of enumerating meander configurations. The study of equivalence classes of foldings and meanders under symmetries allows to characterize and enumerate folding and meander shapes. We describe symmetric foldings and meanders, and we give formulas relating folding and meander sequences. We ...

River Restoration and Meanders

Among the most visually striking river restoration projects are those that involve the creation of a new channel, often in a new alignment and generally with a form and dimensions that are different from those of the preproject channel. These channel reconstruction projects often have the objective of creating a stable, single-thread, meandering channel, even on rivers that were not historicall...

Meanders and Motzkin Words